<memory management> A kind of virtual memory where a page of memory will be paged in if an attempt is made to access it and it is not already present in main memory. This normally involves a memory management unit which looks up the virtual address in a page map to see if it is paged in. If it is not then the operating system will page it in, update the page map and restart the failed access. This implies that the processor must be able to recover from and restart a failed memory access or must be suspended while some other mechanism is used to perform the paging. Paging in a page may first require some other page to be moved from main memory to disk ("paged out") to make room. If this page has not been modified since it was paged in, it can simply be reused without writing it back to disk. This is determined from the "modified" or "dirty" flag bit in the page map. A replacement algorithm or policy is used to select the page to be paged out, often this is the {least recently used} (LRU) algorithm. Prepaging is generally more efficient than demand paging. (1998-04-24)

In computer operating systems, demand paging (as opposed to anticipatory paging) is a method of virtual memory management. In a system that uses demand paging, the operating system copies a disk page into physical memory only if an attempt is made to access it and that page is not already in memory (i.

In economics, the labor demand of an employer is the number of labor-hours that the employer is willing to hire based on the various exogenous (externally determined) variables it is faced with, such as the wage rate, the unit cost of capital, the market-determined selling price of its output, etc. The function specifying the quantity of labor that would be demanded at any of various possible values of these exogenous variables is called the labor demand function.